Infinite Horizon Problems

نویسنده

  • ARCHIS GHATE
چکیده

A typical discrete-time sequential decision problem involves a system whose state is assumed to evolve either deterministically or probabilistically over time-periods that are often called stages. This evolution is affected by the decisions a planner makes at the beginning of each stage after observing the system state. The decision maker’s goal then is to optimize some measure of system performance over a certain time-horizon. For example, in a typical production and inventory management problem, the system state is given by the inventory on hand at the beginning of a stage, and the decision corresponds to the production level in that stage. The inventory beginning the next stage equals the old inventory plus the production quantity minus the stochastic demand filled. Unsatisfied demand may be lost. The planner’s goal may be to maximize the expected total discounted profit, where revenue is generated by selling the product, and costs are incurred for production, inventory holding, and shortage. The dynamic systems in such optimization problems often do not have a predetermined time of extinction. Thus, using a finite planning horizon typically introduces endof-study effects on early decisions. Indeed, a finite horizon formulation of a production planning problem essentially amounts to assuming that the demand in all subsequent time-periods after this horizon is zero. Then the decision maker is likely to plan initial production such that the inventory ending this finite horizon is zero, forcing him/her to produce additional units later when the actual demand beyond the initial study horizon is

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convergence of trajectories in infinite horizon optimization

In this paper, we investigate the convergence of a sequence of minimizing trajectories in infinite horizon optimization problems. The convergence is considered in the sense of ideals and their particular case called the statistical convergence. The optimality is defined as a total cost over the infinite horizon.

متن کامل

Solving infinite horizon optimal control problems of nonlinear interconnected large-scale dynamic systems via a Haar wavelet collocation scheme

We consider an approximation scheme using Haar wavelets for solving a class of infinite horizon optimal control problems (OCP's) of nonlinear interconnected large-scale dynamic systems. A computational method based on Haar wavelets in the time-domain is proposed for solving the optimal control problem. Haar wavelets integral operational matrix and direct collocation method are utilized to find ...

متن کامل

Reinforcement Learning with Time

This paper steps back from the standard infinite horizon formulation of reinforcement learning problems to consider the simpler case of finite horizon problems. Although finite horizon problems may be solved using infinite horizon learning algorithms by recasting the problem as an infinite horizon problem over a state space extended to include time, we show that such an application of infinite ...

متن کامل

On Existence Results for Infinite Horizon Optimal Control Problems

Still at the beginning of the previous century the optimal control problems with infinite horizon became very important with regards to applications in economics and biology, where an infinite horizon seems to be a very natural phenomenon, (5), (3), (10). Since then these problems were treated by many authors and various necessary, sufficient as well as transversality conditions were obtained, ...

متن کامل

Degeneracy in infinite horizon optimization

We consider sequential decision problems over an infinite horizon. The forecast or solution horizon approach to solving such problems requires that the optimal initial decision be unique. We show that multiple optimal initial decisions can exist in general and refer to their existence as degeneracy. We then present a conceptual cost perturbation algorithm for resolving degeneracy and identifyin...

متن کامل

Infinite-Horizon Proactive Dynamic DCOPs

The Distributed Constraint Optimization Problem (DCOP) formulation is a powerful tool for modeling multi-agent coordination problems. Researchers have recently extended this model to Proactive Dynamic DCOPs (PD-DCOPs) to capture the inherent dynamism present in many coordination problems. The PD-DCOP formulation is a finite-horizon model that assumes a finite horizon is known a priori. It ignor...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010